Transforming Recurrent Sequences by Using the Binomial and Invert Operators

In this paper we study the action of the Binomial and Invert (interpolated) operators on the set of linear recurrent sequences. We prove that these operators preserve this set, and we determine how they change the characteristic polynomials. We show that these operators, with the aid of two other elementary operators (essentially the left and right shifts), can transform any impulse sequence (a linear recurrent sequence starting from (0, . . . , 0, 1)) into any other impulse sequence, by two processes that we call construction and deconstruction. Finally, we give some applications to polynomial sequences and pyramidal numbers. We also find a new identity on Fibonacci numbers, and we prove that r–bonacci numbers are a Bell polynomial transform of the (r − 1)– bonacci numbers.